Network Propagation with Dual Flow for Gene Prioritization
نویسندگان
چکیده
منابع مشابه
Network Propagation with Dual Flow for Gene Prioritization
Based on the hypothesis that the neighbors of disease genes trend to cause similar diseases, network-based methods for disease prediction have received increasing attention. Taking full advantage of network structure, the performance of global distance measurements is generally superior to local distance measurements. However, some problems exist in the global distance measurements. For example...
متن کاملNetwork-based gene-disease prioritization using PROPHNET
Motivation and Objectives A major goal in biomedicine is to determine the underlying genetic causes of human diseases in order to better understand them and support their prevention and treatment. However, the genetic bases of many multifactorial diseases are still unclear, and high-throughput technologies typically report hundred or thousands of genes associated to a disease of interest. In th...
متن کاملPathway-Dependent Effectiveness of Network Algorithms for Gene Prioritization
A network-based approach has proven useful for the identification of novel genes associated with complex phenotypes, including human diseases. Because network-based gene prioritization algorithms are based on propagating information of known phenotype-associated genes through networks, the pathway structure of each phenotype might significantly affect the effectiveness of algorithms. We systema...
متن کاملCandidate gene prioritization with Endeavour
Genomic studies and high-throughput experiments often produce large lists of candidate genes among which only a small fraction are truly relevant to the disease, phenotype or biological process of interest. Gene prioritization tackles this problem by ranking candidate genes by profiling candidates across multiple genomic data sources and integrating this heterogeneous information into a global ...
متن کاملBelief Propagation for Min-cost Network Flow: Convergence & Correctness
We formulate a Belief Propagation (BP) algorithm in the context of the capacitated minimum-cost network flow problem (MCF). Unlike most of the instances of BP studied in the past, the messages of BP in the context of this problem are piecewise-linear functions. We prove that BP converges to the optimal solution in pseudo-polynomial time, provided that the optimal solution is unique and the prob...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PLOS ONE
سال: 2015
ISSN: 1932-6203
DOI: 10.1371/journal.pone.0116505